84 research outputs found
A Combined Preconditioning Strategy for Nonsymmetric Systems
We present and analyze a class of nonsymmetric preconditioners within a
normal (weighted least-squares) matrix form for use in GMRES to solve
nonsymmetric matrix problems that typically arise in finite element
discretizations. An example of the additive Schwarz method applied to
nonsymmetric but definite matrices is presented for which the abstract
assumptions are verified. A variable preconditioner, combining the original
nonsymmetric one and a weighted least-squares version of it, is shown to be
convergent and provides a viable strategy for using nonsymmetric
preconditioners in practice. Numerical results are included to assess the
theory and the performance of the proposed preconditioners.Comment: 26 pages, 3 figure
Mixed Covolume Methods for Elliptic Problems on Triangular Grids
We consider a covolume or finite volume method for a system of first-order PDEs resulting from the mixed formulation of the variable coefficient-matrix Poisson equation with the Neumann boundary condition. The system may represent either the Darcy law and the mass conservation law in anisotropic porous media flow, or Fourier law and energy conservation. The velocity and pressure are approximated by the lowest order Raviart-Thomas space on triangles. We prove its first-order optimal rate of convergence for the approximate velocities in the L2-and H(div; Q)-norms as well as for the approximate pressures in the L2-norm. Numerical experiments are included
BootCMatch: A software package for bootstrap AMG based on graph weighted matching
This article has two main objectives: one is to describe some extensions of an adaptive Algebraic Multigrid (AMG) method of the form previously proposed by the first and third authors, and a second one is to present a new software framework, named BootCMatch, which implements all the components needed to build and apply the described adaptive AMG both as a stand-alone solver and as a preconditioner in a Krylov method. The adaptive AMG presented is meant to handle general symmetric and positive definite (SPD) sparse linear systems, without assuming any a priori information of the problem and its origin; the goal of adaptivity is to achieve a method with a prescribed convergence rate. The presented method exploits a general coarsening process based on aggregation of unknowns, obtained by a maximum weight matching in the adjacency graph of the system matrix. More specifically, a maximum product matching is employed to define an effective smoother subspace (complementary to the coarse space), a process referred to as compatible relaxation, at every level of the recursive two-level hierarchical AMG process.
Results on a large variety of test cases and comparisons with related work demonstrate the reliability and efficiency of the method and of the software
Nonlinear multigrid based on local spectral coarsening for heterogeneous diffusion problems
This work develops a nonlinear multigrid method for diffusion problems
discretized by cell-centered finite volume methods on general unstructured
grids. The multigrid hierarchy is constructed algebraically using aggregation
of degrees of freedom and spectral decomposition of reference linear operators
associated with the aggregates. For rapid convergence, it is important that the
resulting coarse spaces have good approximation properties. In our approach,
the approximation quality can be directly improved by including more spectral
degrees of freedom in the coarsening process. Further, by exploiting local
coarsening and a piecewise-constant approximation when evaluating the nonlinear
component, the coarse level problems are assembled and solved without ever
re-visiting the fine level, an essential element for multigrid algorithms to
achieve optimal scalability. Numerical examples comparing relative performance
of the proposed nonlinear multigrid solvers with standard single-level
approaches -- Picard's and Newton's methods -- are presented. Results show that
the proposed solver consistently outperforms the single-level methods, both in
efficiency and robustness
Mixed Upwinding Covolume Methods on Rectangular Grids for Convection-diffusion Problems
We consider an upwinding covolume or control-volume method for a system of rst order PDEs resulting from the mixed formulation of a convection-di usion equation with a variable anisotropic di usion tensor. The system can be used to model the steady state of the transport of a contaminant carried by a °ow. We use the lowest order Raviart{Thomas space and show that the concentration and concentration °ux both converge at one-half order provided that the exact °ux is in H1(Â)2 and the exact concentration is in H1(Â). Some numerical experiments illustrating the error behavior of the scheme are provided
Parallel Element-Based Algebraic Multigrid for H (Curl) And H (Div) Problems Using the Parelag Library
This paper presents the use of element-based algebraic multigrid (AMGe) hierarchies, implemented in the Parallel Element Agglomeration Algebraic Multigrid Upscaling and Solvers (ParELAG) library, to produce multilevel preconditioners and solvers for H (curl) and H (div) formulations. ParELAG constructs hierarchies of compatible nested spaces, forming an exact de Rham sequence on each level. This allows the application of hybrid smoothers on all levels and the Auxiliary-Space Maxwell Solver or the Auxiliary-Space Divergence Solver on the coarsest levels, obtaining complete multigrid cycles. Numerical results are presented, showing the parallel performance of the proposed methods. As a part of the exposition, this paper demonstrates some of the capabilities of ParELAG and outlines some of the components and procedures within the library
- …